basic solution
Adaptive Resolving Methods for Reinforcement Learning with Function Approximations
Jiang, Jiashuo, Zong, Yiming, Ye, Yinyu
Reinforcement learning (RL) problems are fundamental in online decision-making and have been instrumental in finding an optimal policy for Markov decision processes (MDPs). Function approximations are usually deployed to handle large or infinite state-action space. In our work, we consider the RL problems with function approximation and we develop a new algorithm to solve it efficiently. Our algorithm is based on the linear programming (LP) reformulation and it resolves the LP at each iteration improved with new data arrival. Such a resolving scheme enables our algorithm to achieve an instance-dependent sample complexity guarantee, more precisely, when we have $N$ data, the output of our algorithm enjoys an instance-dependent $\tilde{O}(1/N)$ suboptimality gap. In comparison to the $O(1/\sqrt{N})$ worst-case guarantee established in the previous literature, our instance-dependent guarantee is tighter when the underlying instance is favorable, and the numerical experiments also reveal the efficient empirical performances of our algorithms.
- Information Technology > Artificial Intelligence > Representation & Reasoning > Constraint-Based Reasoning (1.00)
- Information Technology > Artificial Intelligence > Machine Learning > Reinforcement Learning (1.00)
- Information Technology > Artificial Intelligence > Machine Learning > Learning Graphical Models > Undirected Networks > Markov Models (0.48)
Fiber Transmission Model with Parameterized Inputs based on GPT-PINN Neural Network
Zang, Yubin, Hua, Boyu, Lin, Zhipeng, Zhang, Fangzheng, Li, Simin, Zhang, Zuxing, Chen, Hongwei
In this manuscript, a novelty principle driven fiber transmission model for short-distance transmission with parameterized inputs is put forward. By taking into the account of the previously proposed principle driven fiber model, the reduced basis expansion method and transforming the parameterized inputs into parameterized coefficients of the Nonlinear Schrodinger Equations, universal solutions with respect to inputs corresponding to different bit rates can all be obtained without the need of re-training the whole model. This model, once adopted, can have prominent advantages in both computation efficiency and physical background. Besides, this model can still be effectively trained without the needs of transmitted signals collected in advance. Tasks of on-off keying signals with bit rates ranging from 2Gbps to 50Gbps are adopted to demonstrate the fidelity of the model.
25 Examples of A.I. That Will Seem Normal in 2027
In the last ten years, artificial intelligence has changed the world in subtle but sweeping ways, but it's got nothing on the coming decade, if you look at what's being developed today. Voice recognition on every smartphone were simple proofs of concept. Over the next 10 years, artificial intelligence will make more progress than in the fifty before it, combined. With countless quickly oncoming applications to business, government, and personal life, its influence will soon touch absolutely every aspect of our lives. Here are 25 surprising ways life and society that will be forever changed by artificial intelligence over the coming decade.
- North America > United States (0.94)
- North America > Mexico (0.04)
- North America > Canada > British Columbia > Metro Vancouver Regional District > Vancouver (0.04)